An Efficient Algorithm for Reasoning about Fuzzy Functional Dependencies
نویسندگان
چکیده
A sound and complete Automated Prover for the Fuzzy Simplification Logic (FSL logic) is introduced and based on it a method for efficiently reasoning about fuzzy functional dependencies over domains with similarity relations. The complexity of the algorithm is the same as that of equivalent algorithms for crisp functional dependencies that appear in the literature.
منابع مشابه
Mining Full Functional Dependency to Answer Null Queries and Reduce Imprecise Information Based on Fuzzy Object Oriented Databases
Discovery of Full functional dependencies from relations has been identified as an important database analysis technique. In order to deal with information inexactness, fuzzy techniques have extensively been integrated with different database models and theories. However, the information is often vague or ambiguous and very difficult to represent in implementing the application software. This p...
متن کاملAutomated Inference with Fuzzy Functional Dependencies over Graded Data
Fuzzy set theory has proved to be a successful paradigm to extend the database relational model, augmenting its skill to capture uncertaintly. This capability may be consider in two levels: the data itself and the constraints defined to adjust the database schema to the real system. When constraints are considered, it is necessary to design methods to reason about it and not only a way to expre...
متن کاملAn Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks Using Fuzzy Inference Systems
An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The alg...
متن کاملModeling Fuzzy Rules with Description Logics
In real application scenarios, input data and knowledge is often vague. Likewise, it is often the case that exact reasoning over data is impossible due to complex dependencies between input data and target outputs. For practical applications, however, good approximations often suffice, and efficient calculation of an approximate answer is often preferable over complex processing which may take ...
متن کاملFuzzy attribute logic over complete residuated lattices
We present a logic, called fuzzy attribute logic, for reasoning about formulas describing particular attribute dependencies. The formulas are of a form A ⇒ B where A and B are collections of attributes. Our formulas can be interpreted in two ways. First, in data tables with entries containing degrees to which objects (table rows) have attributes (table columns). Second, in database tables where...
متن کامل